A physically universal Turing machine

نویسندگان

چکیده

We construct a two-dimensional Turing machine that is physically universal in both the moving tape and head model. In particular, it mixing of all finite orders models. also provide variant model, but not

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alan Turing Universal Turing Machine

In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.

متن کامل

Universal Turing Machine

Recent advances in amphibious theory and flexible archetypes are based entirely on the assumption that e-business and write-back caches are not in conflict with XML. after years of extensive research into web browsers, we demonstrate the evaluation of Internet QoS. We disprove that fiber-optic cables and lambda calculus are rarely incompatible.

متن کامل

A small fast universal Turing machine

We present a small time-efficient universal Turing machine with 5 states and 6 symbols. This Turing machine simulates our new variant of tag system. It is the smallest known universal Turing machine that simulates Turing machine computations in polynomial time.

متن کامل

Deutsch's Universal Quantum Turing Machine (revisited)

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...

متن کامل

An Embryonics Implementation of a Self-Replicating Universal Turing Machine

The goal of this contribution is to describe how a universal Turing machine was embedded into a hardware system in order to verify the computational universality of a novel architecture. This implementation was realized with a multicellular automaton inspired by the embryonic development of living organisms. In such an architecture, every artificial “cell” contains a complete copy of the descri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2023

ISSN: ['1090-2724', '0022-0000']

DOI: https://doi.org/10.1016/j.jcss.2022.08.003